Motion detection: cells, circuits and algorithms
نویسندگان
چکیده
منابع مشابه
Functional specialization of parallel motion detection circuits in the fly.
In the fly Drosophila melanogaster, photoreceptor input to motion vision is split into two parallel pathways as represented by first-order interneurons L1 and L2 (Rister et al., 2007; Joesch et al., 2010). However, how these pathways are functionally specialized remains controversial. One study (Eichner et al., 2011) proposed that the L1-pathway evaluates only sequences of brightness increments...
متن کاملVisual motion detection circuits in flies: peripheral motion computation by identified small-field retinotopic neurons.
Giant motion-sensitive tangential neurons in the lobula plate are thought to be cardinal elements in the oculomotor pathways of flies. However, these large neurons do not themselves compute motion, and elementary motion detectors have been proposed only from theory. Here we identify the forms, projections, and responses of small-field retinotopic neurons that comprise a well known pathway from ...
متن کاملDetection of Cardiac Hypertrophy by RVM and SVM Algorithms
The meaning of the hypertropy word is the increasing size.Heart hypertropy is symptoms of increase the thickness of the heart muscle that the left ventricular hypertrophy of them is the most common.The causes of hypertrophy heart disease are high blood pressure , aortic valve stenosis and sport activities respectively. Assessment of that by using ECG signal analysis is essential Because the ris...
متن کاملOptimization of Fast Block Motion Estimation Algorithms - Circuits and Systems for Video Technology, IEEE Transactions on
There are basically three approaches for carrying out fast block motion estimation: 1) fast search by a reduction of motion vector candidates; 2) fast block-matching distortion (BMD) computation; and 3) motion field subsampling. The first approach has been studied more extensively since different ways of reducing motion vector candidates may result in significantly different performance; while ...
متن کاملAlgorithms for Arithmetic Circuits
Given a multivariate polynomial f(X) ∈ F[X] as an arithmetic circuit we would like to efficiently determine: 1. Identity Testing. Is f(X) identically zero? 2. Degree Computation. Is the degree of the polynomial f(X) at most a given integer d . 3. Polynomial Equivalence. Upto an invertible linear transformation of its variables, is f(X) equal to a given polynomial g(X). The algorithmic complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neuroforum
سال: 2018
ISSN: 2363-7013
DOI: 10.1515/nf-2017-a028